A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring

for Graph 3-Coloring Iztok Fister Jr.,∗ Iztok Fister,† and Janez Brest‡ Abstract The Artificial Bee Colony (ABC) is the name of an optimization algorithm that was inspired by the intelligent behavior of a honey bee swarm. It is widely recognized as a quick, reliable, and efficient methods for solving optimization problems. This paper proposes a hybrid ABC (HABC) algorithm for graph 3-coloring, which is a well-known discrete optimization problem. The results of HABC are compared with results of the well-known graph coloring algorithms of today, i.e. the Tabucol and Hybrid Evolutionary algorithm (HEA) and results of the traditional evolutionary algorithm with SAW method (EA-SAW). Extensive experimentations has shown that the HABC matched the competitive results of the best graph coloring algorithms, and did better than the traditional heuristics EA-SAW when solving equi-partite, flat, and random generated medium-sized graphs. To cite paper as follows: I.Jr. Fister, I. Fister and J. Brest. A Hybrid Artificial Bee Colony Algorithm for Graph 3-Coloring. In Swarm and Evolutionary Computation, Lecture Notes in Computer Science, 7269, Springer Berlin / Heidelberg, 66–74 (2012).